منابع مشابه
On the Notion of Fuzzy Shadowing Property
This paper is concerned with the study of fuzzy dynamical systems. Let (XM ) be a fuzzy metric space in the sense of George and Veeramani. A fuzzy discrete dynamical system is given by any fuzzy continuous self-map dened on X. We introduce the various fuzzy shad- owing and fuzzy topological transitivity on a fuzzy discrete dynamical systems. Some relations between this notions have been proved.
متن کاملThe Simplest Free Radicals
INTRODUCTION Every lexicographer knows that the meaning of a word is time dependent, and, in favour of the argument that it is also dependent on latitude and longitude, the perverse amonst us would cite Oscar Wilde's dictum, "England and America are two countries separated by a common language". Certainly the word radical has changed its meaning for chemits who originally thought of it as part ...
متن کاملThe simplest Eisenstein series
We explain some essential aspects of the simplest Eisenstein series for SL2(Z) on the upper half-plane H. There are many different proofs of meromorphic continuation and functional equation of the simplest Eisenstein series for Γ = SL2(Z). We will follow [Godement 1966a] rewriting of a Poisson summation argument that appeared in [Rankin 1939], if not earlier. This argument is the most elementar...
متن کاملThe simplest protoalgebraic logic
The logic I is the sentential logic defined in the language with just implication → by the axiom of reflexivity or identity “φ→ φ” and the rule of Modus Ponens “from φ and φ→ ψ to infer ψ”. The theorems of this logic are exactly all formulas of the form φ→ φ. I argue that this is the simplest protoalgebraic logic, and that in it every set of assumptions encodes in itself not only all its conseq...
متن کاملEditing the Simplest Graphs
We study the complexity of editing a graph into a target graph with any fixed critical-clique graph. The problem came up in practice, in mining a huge word similarity graph for well structured word clusters. It also adds to the rich field of graph modification problems. We show in a generic way that several variants of this problem are in SUBEPT. As a special case, we give a tight time bound fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Polonici Mathematici
سال: 1993
ISSN: 0066-2216,1730-6272
DOI: 10.4064/ap-58-3-253-258